Data storage device encoding and interleaving codewords to improve trellis sequence detection

ABSTRACT

A data storage device is disclosed comprising a storage medium. Input data is encoded according to at least one channel code constraint to generate first data and second data. The first data is encoded into a first codeword, and the second data is encoded into a second codeword, wherein a first code rate of the first codeword is less than a second code rate of the second codeword. The first codeword and the second codeword are interleaved to generate an interleaved codeword, and the interleaved codeword is written to the storage medium.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation-in-part of U.S. patent application Ser. No. 14/930,898, filed on Nov. 3, 2015, entitled “DATA STORAGE DEVICE ENCODING AND INTERLEAVING CODEWORDS TO IMPROVE TRELLIS SEQUENCE DETECTION,” which is hereby incorporated by reference in its entirety.

BACKGROUND

Data storage devices such as disk drives comprise a disk and a head connected to a distal end of an actuator arm which is rotated about a pivot by a voice coil motor (VCM) to position the head radially over the disk. The disk comprises a plurality of radially spaced, concentric tracks for recording user data sectors and servo sectors. The servo sectors comprise head positioning information (e.g., a track address) which is read by the head and processed by a servo control system to control the actuator arm as it seeks from track to track.

FIG. 1 shows a prior art disk format 2 as comprising a number of servo tracks 4 defined by servo sectors 6 ₀-6 _(N) recorded around the circumference of each servo track. Each servo sector 6 _(i) comprises a preamble 8 for storing a periodic pattern, which allows proper gain adjustment and timing synchronization of the read signal, and a sync mark 10 for storing a special pattern used to symbol synchronize to a servo data field 12. The servo data field 12 stores coarse head positioning information, such as a servo track address, used to position the head over a target data track during a seek operation. Each servo sector 6 _(i) further comprises groups of servo bursts 14 (e.g., N and Q servo bursts), which are recorded with a predetermined phase relative to one another and relative to the servo track centerlines. The phase based servo bursts 14 provide fine head position information used for centerline tracking while accessing a data track during write/read operations. A position error signal (PES) is generated by reading the servo bursts 14, wherein the PES represents a measured position of the head relative to a centerline of a target servo track. A servo controller processes the PES to generate a control signal applied to a head actuator (e.g., a voice coil motor) in order to actuate the head radially over the disk in a direction that reduces the PES.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a prior art disk format comprising a plurality of servo tracks defined by servo sectors.

FIG. 2A shows a data storage device in the form of a disk drive according to an embodiment comprising a head actuated over a disk.

FIG. 2B is a flow diagram according to an embodiment wherein first and second mixed rate codewords are interleaved to generate an interleaved codeword written to the disk.

FIG. 2C shows an embodiment wherein a first codeword having a code rate of N is interleaved with a larger, second codeword having a code rate greater than N.

FIG. 3 shows control circuitry according to an embodiment wherein the lower rate of the first codeword increases the accuracy of a trellis detector during a second and subsequent global iterations.

FIGS. 4A and 4B illustrate that when the first codeword is successfully decoded, the corresponding reliability metrics effectively prune branches from the trellis of the trellis detector when performing subsequent iterations to recover the second codeword.

FIG. 5 is a flow diagram according to an embodiment wherein the encoded codewords are first interleaved in a non-uniform (e.g., random) manner, and then the non-uniform interleaved codewords are interleaved in a uniform manner to generate an interleaved codeword written to the disk.

FIG. 6A is a flow diagram according to an embodiment wherein input data is first encoded based on a channel code, and then encoded into first and second codewords having different code rates.

FIG. 6B shows an embodiment wherein the parity data of the interleaved codeword is not encoded based on the channel code constraint.

FIG. 7 shows control circuitry according to an embodiment comprising a modulation decoder for decoding the interleaved codeword output by the multi-rate decoders.

FIG. 8 illustrates performance comparisons (sector failure rate (SFR) versus SNR) for different embodiments employing different encoding schemes.

DETAILED DESCRIPTION

FIG. 2A shows a data storage device in the form of a disk drive according to an embodiment comprising a head 16 actuated over a disk 18. The disk drive further comprises control circuitry 20 configured to execute the flow diagram of FIG. 2B, wherein first data is encoded into a first codeword (block 22), and second data is encoded into a second codeword (block 24). The first codeword and the second codeword are interleaved to generate an interleaved codeword (block 26) that is written to the disk (block 28). In one embodiment, a first code rate of the first codeword is less than a second code rate of the second codeword as illustrated in the example shown in FIG. 2C. Also in the embodiment of FIG. 2C, the first codeword is smaller in size than the second codeword such that the code rate of the concatenated (interleaved) codeword achieves a desired format efficiency when written to the disk. As described in greater detail below, in one embodiment the lower code rate of the first codeword improves the probability of successfully decoding the first codeword, and when the first codeword is successfully decoded (or nearly decoded), the corresponding reliability metrics may improve the accuracy of a trellis detector when performing subsequent iterations to recover the second codeword.

In the embodiment of FIG. 2A, the disk 18 comprises a plurality of servo sectors 30 ₀-30 _(N) that define a plurality of servo tracks 32, wherein data tracks are defined relative to the servo tracks at the same or different radial density. The control circuitry 20 processes a read signal 34 emanating from the head 16 to demodulate the servo sectors 30 ₀-30 _(N) and generate a position error signal (PES) representing an error between the actual position of the head and a target position relative to a target track. A servo control system in the control circuitry 20 filters the PES using a suitable compensation filter to generate a control signal 36 applied to a voice coil motor (VCM) 38 which rotates an actuator arm 40 about a pivot in order to actuate the head 16 radially over the disk 18 in a direction that reduces the PES. The servo sectors 30 ₀-30 _(N) may comprise any suitable head position information, such as a track address for coarse positioning and servo bursts for fine positioning. The servo bursts may comprise any suitable pattern, such as an amplitude based servo pattern or a phase based servo pattern (FIG. 1).

FIG. 3 shows control circuitry according to an embodiment wherein first data is encoded by a first rate encoder 42A to generate a first codeword 44A, and second data is encoded by a second rate encoder 42B to generate a second codeword 44B. The encoders may operate according to any suitable encoding scheme, such as a low density parity check (LDPC) code, and the encoders may generate the codewords having any suitable code rate and size. In one embodiment, the first codeword 44A may be 1K in size and encoded to have a code rate of 0.65, and the second codeword 44B may be 3K in size and encoded to have a code rate of 0.85, such that the concatenated, interleaved codeword may be 4K in size and have an overall code rate of 0.8 which is proximate to the code rate of the larger, second codeword 44B.

A first non-uniform interleaver 46A interleaves the first codeword 44A to generate a first non-uniform interleaved codeword 48A, and a second non-uniform interleaver 46B interleaves the second codeword 44B to generate a second non-uniform interleaved codeword 48B. Any suitable non-uniform interleaver may be employed, wherein in one embodiment the non-uniform interleavers 46A and 46B operate to randomly interleave the symbols of the respective codewords. In one embodiment, randomly interleaving the symbols of each codeword improves the performance of an iterative detection scheme, such as with an outer LDPC code and an inner trellis detector. In the embodiment of FIG. 3, a uniform interleaver 50 interleaves the first and second non-uniform interleaved codewords 48A and 48B to generate the interleaved codeword 52 written to the disk 18. In the embodiment, the uniform interleaver 50 interleaves the codewords 48A and 48B based on the ratio of the codeword sizes. For example in an embodiment where the first non-uniform interleaved codeword 48A is 1K in size and the second non-uniform interleaved codeword 48B is 3K in size, the uniform interleaver 50 may perform a 1:3 interleaving of the symbols such that there is a repeating sequence of one symbol from the first codeword 48A followed by three symbols from the second codeword 48B (e.g., as illustrated in FIG. 2C).

During a read operation, the read signal 34 is processed by an analog-front-end (AFE) and equalizer circuitry 54 (which may comprise analog circuitry or digital circuitry or a combination of both). For example, in one embodiment block 54 may comprise an analog equalizer, followed by a sampler for sampling the read signal, followed by a digital equalizer that equalizes the signal samples based on a suitable response, such as a suitable partial response (e.g., PR4). The equalized signal samples 56 are input into a trellis detector 60 which processes the signal samples to generate a sequence of reliability metrics 62 representing the interleaved codeword that was written to the disk. Any suitable trellis detector 60 may be employed, such as a soft-input soft-output Viterbi detector or a Bahl, Cocke, Jelinek and Raviv (BCJR) detector. In addition, the trellis detector 60 may generate any suitable reliability metric for each symbol in the interleaved codeword, such as a log-likelihood ratio (LLR) representing a likelihood that each symbol was detected correctly.

A uniform de-interleaver 64 and respective non-uniform de-interleavers 66A and 66B de-interleave the sequence of reliability metrics 62 output by the trellis detector 60 into a first set of reliability metrics 68A representing the first codeword 44A and a second set of reliability metrics 68B representing the second codeword 44B. A first rate decoder 70A decodes the first set of reliability metrics 68A to generate a third set of reliability metrics 72A representing the first codeword 44A, and a second rate decoder 70B decodes the second set of reliability metrics 68B to generate a fourth set of reliability metrics 72B representing the second codeword 44B. The third set of reliability metrics 72A and the fourth set of reliability metrics 72B are re-interleaved to generate interleaved reliability metrics 74 representing the interleaved codeword. The interleaved reliability metrics 74 are input into the trellis detector 60 which performs another iteration to generate another sequence of reliability metrics 62 representing the interleaved codeword that was written to the disk.

In one embodiment, the decoders 70A and 70B execute local iterations on the respective sets of reliability metrics 68A and 68B. If the decoders reach their maximum iteration limit, the codeword is considered unrecoverable during the current global iteration, and therefore the current reliability metrics 72A and 72B generated by the decoders are re-interleaved and fed back to the trellis detector 60. In one embodiment, the increased redundancy that causes the lower code rate of the first codeword 44A helps improve the accuracy of the first rate decoder 70A such that the probability of successfully decoding the first codeword increases. If the first codeword is successfully decoded, but the second codeword is not successfully decoded, the reliability metrics 72A for the first codeword will be 100% which, as described below, effectively prunes branches from the trellis of the trellis detector 60. Even if the first codeword is not successfully decoded, the interim reliability metrics 72A generated by the first rate decoder 70A may be more accurate (i.e., closer to 100%) due to the increase in redundancy of the first codeword 44A. In either case, the higher reliability metrics 72A of the first codeword 44A bias the trellis detector 60 during the next global iteration so as to improve the accuracy of the trellis detector (for either or both of the codewords). That is, interleaving the higher reliability metrics 72A of the first codeword 44A with the lower reliability metrics 72B of the second codeword 44B may improve the accuracy of the trellis detector by pruning or biasing the branches corresponding to the symbols of the first codeword 44A.

FIGS. 4A and 4B illustrate how in one embodiment the lower rate of the first codeword 44A may prune the corresponding branches of the trellis during a second or subsequent global iteration. FIG. 4A shows a full trellis as implemented during the first global iteration wherein the symbols of both the first and second codeword are unknown. During a subsequent global iteration, the first codeword 44A may be successfully decoded by the first rate decoder 70A due to the lower code rate of the first codeword 44A. Accordingly as shown in FIG. 4B, the branches that correspond to the known symbols of the first codeword 44A are pruned from the trellis which increases the accuracy of the trellis detector 60 when detecting the symbols of the second codeword 44B. In one embodiment, the branches of the trellis may be literally pruned from the trellis based on the known symbols of the first codeword 44A, and in another embodiment, the reliability metrics being 100% for each symbol of the first codeword 44A biases the trellis so as to effectively prune the corresponding branches from the trellis.

FIG. 5 is a flow diagram according to an embodiment wherein first data is encoded into a first codeword (block 76), and second data is encoded into a second codeword (block 78). A non-uniform interleaving of the first codeword is executed to generate a first non-uniform interleaved codeword (block 80), and a non-uniform interleaving of the second codeword is executed to generate a second non-uniform interleaved codeword (block 82). A uniform interleaving of the first non-uniform interleaved codeword and the second non-uniform interleaved codeword is executed to generate an interleaved codeword (block 84), and the interleaved codeword is written to the disk (block 86). In one embodiment, the first codeword has a rate and/or size that is different from a rate and/or size of the second codeword as described above. In another embodiment, the first and second codewords may have the same rate and/or the same size. As described above, interleaving the codewords using a uniform interleaver may improve the accuracy of a trellis detector, particularly when the decoding of one of the codewords provides higher reliability metrics for the second and subsequent global iterations by the trellis detector.

FIG. 6A is a flow diagram according to an embodiment which is understood with reference to FIG. 6B, wherein input data is encoded according to at least one channel code constraint to generate first data and second data (block 88). The first data is encoded into a first codeword (block 90), and the second data is encoded into a second codeword (block 92), wherein a first code rate of the first codeword is less than a second code rate of the second codeword. The first codeword and the second codeword are interleaved to generate an interleaved codeword (block 94), and the interleaved codeword is written to the storage medium (block 96).

The input data may be encoded based a channel code constraint that implements any suitable modulation code. Examples of a suitable modulation code include a run-length limited (RLL) code which constrains the minimum and maximum run-length of zero bits (in NRZI recording), or a maximum transition run (MTR) code which constrains the maximum run-length of zero bits and run-length of one bits. Other examples of a suitable modulation code include trellis codes, DC free codes, matched spectral null codes, and other codes directed at increasing the effective signal-to-noise ratio (SNR) of the recording channel.

FIG. 7 shows control circuitry according to an embodiment wherein a suitable modulation encoder 98 encodes the input data based on the channel code constraint to generate channel constrained data 100. A first number of bytes (e.g., 1K bytes) of the channel constrained data 100 are then encoded by the 1^(st) rate encoder 42A, and a second number of bytes (e.g., 3K bytes) of the channel constrained data 100 are encoded by the 2^(nd) rate encoder 42B. The resulting 1^(st) codeword 44A and second codeword 44B are interleaved using the uniform interleaver 50 to generate the interleaved codeword 52 such as shown in FIG. 6B. In this embodiment, the interleaved codeword 52 written to the storage medium comprises two interleaved codewords each comprising channel constrained data sections and parity data that is not encoded according to the channel code constraint, thereby maintaining the modulation code as the outer code and the multi-rate code as the inner code. During a read operation, the interleaved codeword is detected/decoded using local and global iterations through the trellis detector 60 and multi-rate decoders 70A and 70B as described above. Once the interleaved codeword has been successfully recovered, the data sections of each decoded codeword 72A and 72B are decoded using a suitable modulation decoder 102.

In one embodiment, the interleaved codeword comprises an interleave segment length that defines the interleaving frequency of symbols from each codeword. In the example of FIG. 6B, the interleave segment length is four since there is one symbol from the first codeword inserted after every three symbols from the second codeword. In one embodiment, the interleave segment length is less than or equal to the run-length of the channel code constraint. For example, if the modulation code is an MTR(3, ∞) code, the maximum run-length of consecutive “1” bits is three such that runs of four and longer are eliminated from the interleaved codewords. In this embodiment, selecting the interleave segment length to be less than or equal to the run-length may increase the benefit of the mixed-rate, interleaved codewords. Referring again to the example of FIG. 6B, the uniform interleaving breaks up runs of four bits of the higher rate, second codeword which is similar to limiting the run-length of “1” bits in the second codeword to three bits. Decreasing the interleave segment length of the interleaved codeword to three, such that there is one symbol from the first codeword inserted after every two symbols form the second codeword, breaks up runs of three bits of the higher rate, second codeword. This embodiment may improve the overall performance since the run-length of the channel code breaks up runs of four bits in both codewords, and the interleave segment length breaks up runs of three bits in the second codeword.

FIG. 8 illustrates the performance comparisons (sector failure rate (SFR) versus SNR) for different embodiments employing different encoding schemes, including:

2×2K R=0.85 no intiv—encoding 4K byte input data into two 2K byte codewords having the same rate (0.85) without interleaving and without a modulation code.

2×2K MTR(17/18) only—encoding 4K byte input data into two 2K byte codewords using a MTR(3, ∞) modulation code with rate 17/18 code.

(1K,3K) R=0.85 MR only—encoding 4K byte input data into a 1K byte codeword and a 3K byte codeword having mixed rates (MR) with interleaving and no modulation code.

MR(1:3)+MTR(17/18)—encoding 4K byte input data into a 1K byte codeword and a 3K byte codeword having mixed rates (MR) with interleaving (segment length of four) and MTR(3, ∞) modulation code with rate 17/18.

MR(1:2)+MTR(17/18)—encoding 4K byte input data into a 1K byte codeword and a 2K byte codeword having mixed rates (MR) with interleaving (segment length of three) and MTR(3, ∞) modulation code with rate 17/18.

In the above examples, the mixed rate (MR) encoding of the codewords without the modulation code generates the interleaved codeword having a code rate of 0.85, and the MR encoding of the codewords with the modulation code generates the interleaved codeword having the same 0.85 rate (0.9 rate MR encoding combined with 17/18 rate MTR encoding results in 0.9×17/18=0.85). Accordingly, increasing the rate of the MR code and combining a modulation code enables improved performance without losing capacity, with further performance gain possible when the interleave segment length is selected to be less than or equal to the run-length of the channel code constraint of the modulation code.

In the embodiments described above, the symbols of two codewords are interleaved to generate the interleaved codeword written to the disk. However, in other embodiments more than two codewords may be interleaved, wherein the code rate and/or size of each codeword as well as the symbol size for each codeword may vary (or be the same). For example, in one embodiment each codeword may have a progressively higher code rate and larger size (and optionally a larger symbol size), wherein the lower code rate codewords may be more readily decoded due to the increase in redundancy. In another embodiment when interleaving three or more codewords having the same or different code rate and/or size, the likelihood of successfully decoding at least one of the codewords may improve which may then cascade into the ability to successfully recover the remaining codewords.

Any suitable control circuitry may be employed to implement the flow diagrams in the above embodiments, such as any suitable integrated circuit or circuits. For example, the control circuitry may be implemented within a read channel integrated circuit, or in a component separate from the read channel, such as a disk controller, or certain operations described above may be performed by a read channel and others by a disk controller. In one embodiment, the read channel and disk controller are implemented as separate integrated circuits, and in an alternative embodiment they are fabricated into a single integrated circuit or system on a chip (SOC). In addition, the control circuitry may include a suitable preamp circuit implemented as a separate integrated circuit, integrated into the read channel or disk controller circuit, or integrated into a SOC.

In one embodiment, the control circuitry comprises a microprocessor executing instructions, the instructions being operable to cause the microprocessor to perform the flow diagrams described herein. The instructions may be stored in any computer-readable medium. In one embodiment, they may be stored on a non-volatile semiconductor memory external to the microprocessor, or integrated with the microprocessor in a SOC. In another embodiment, the instructions are stored on the disk and read into a volatile semiconductor memory when the disk drive is powered on. In yet another embodiment, the control circuitry comprises suitable logic circuitry, such as state machine circuitry.

In various embodiments, a disk drive may include a magnetic disk drive, an optical disk drive, etc. In addition, while the above examples concern a disk drive, the various embodiments are not limited to a disk drive and can be applied to other data storage devices and systems, such as magnetic tape drives, solid state drives, hybrid drives, etc. In addition, some embodiments may include electronic devices such as computing devices, data server devices, media content storage devices, etc. that comprise the storage media and/or control circuitry as described above.

The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method, event or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described tasks or events may be performed in an order other than that specifically disclosed, or multiple may be combined in a single block or state. The example tasks or events may be performed in serial, in parallel, or in some other manner. Tasks or events may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.

While certain example embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions disclosed herein. Thus, nothing in the foregoing description is intended to imply that any particular feature, characteristic, step, module, or block is necessary or indispensable. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the embodiments disclosed herein. 

What is claimed is:
 1. A data storage device comprising: a storage medium; and control circuitry configured to: encode input data according to at least one channel code constraint to generate first data and second data; encode the first data into a first codeword; encode the second data into a second codeword, wherein a first code rate of the first codeword is less than a second code rate of the second codeword; interleave the first codeword and the second codeword to generate an interleaved codeword; and write the interleaved codeword to the storage medium.
 2. The data storage device as recited in claim 1, wherein the interleaved codeword written to the storage medium comprises parity data not encoded according to the at least one channel code constraint.
 3. The data storage device as recited in claim 1, wherein the at least one channel code constraint is a maximum transition run (MTR) constraint.
 4. The data storage device as recited in claim 1, wherein the at least one channel code constraint is a run-length limit (RLL) constraint.
 5. The data storage device as recited in claim 1, wherein the control circuitry is further configured to: read the interleaved codeword from the storage medium to generate a read signal; sample the read signal to generate signal samples; process the signal samples with a trellis detector to generate a sequence of reliability metrics representing the interleaved codeword; de-interleave the sequence of reliability metrics into a first set of reliability metrics representing the first codeword and a second set of reliability metrics representing the second codeword; decode the first set of reliability metrics to generate a third set of reliability metrics representing the first codeword; decode the second set of reliability metrics to generate a fourth set of reliability metrics representing the second codeword; interleave the third set of reliability metrics and the fourth set of reliability metrics to generate interleaved reliability metrics representing the interleaved codeword; and process the interleaved reliability metrics with the trellis detector.
 6. The data storage device as recited in claim 5, wherein the first code rate of the first codeword increases the accuracy of the trellis detector when processing the interleaved reliability metrics.
 7. The data storage device as recited in claim 5, wherein the trellis detector implements a soft-input soft-output Viterbi algorithm.
 8. The data storage device as recited in claim 5, wherein the control circuitry is further configured to: decode the first set of reliability metrics and the second set of reliability metrics into the interleaved codeword; and decode the interleaved codeword based on the at least one channel code constraint.
 9. The data storage device as recited in claim 1, wherein the encoding of the first data into the first codeword and the encoding of the second data into the second codeword implement a low density parity check (LDPC) code.
 10. The data storage device as recited in claim 1, wherein: the channel code constraint limits at least one of a maximum transition run (MTR) length and a maximum run-length limit (RLL); the interleaved codeword comprises an interleave segment length; and the interleave segment length is less than or equal to the run-length of the channel code constraint.
 11. A method of operating a data storage device comprising a storage medium and control circuitry, the method comprising: encoding, with the control circuitry, input data according to at least one channel code constraint to generate first data and second data; encoding, with the control circuitry, the first data into a first codeword; encoding, with the control circuitry, the second data into a second codeword, wherein a first code rate of the first codeword is less than a second code rate of the second codeword; interleaving, with the control circuitry, the first codeword and the second codeword to generate an interleaved codeword; and writing, with the control circuitry, the interleaved codeword to the storage medium.
 12. The method as recited in claim 11, wherein the interleaved codeword written to the storage medium comprises parity data not encoded according to the at least one channel code constraint.
 13. The method as recited in claim 11, wherein the at least one channel code constraint is a maximum transition run (MTR) constraint.
 14. The method as recited in claim 11, wherein the at least one channel code constraint is a run-length limit (RLL) constraint.
 15. The method as recited in claim 11, further comprising: reading the interleaved codeword from the storage medium to generate a read signal; sampling the read signal to generate signal samples; processing the signal samples with a trellis detector to generate a sequence of reliability metrics representing the interleaved codeword; de-interleaving the sequence of reliability metrics into a first set of reliability metrics representing the first codeword and a second set of reliability metrics representing the second codeword; decoding the first set of reliability metrics to generate a third set of reliability metrics representing the first codeword; decoding the second set of reliability metrics to generate a fourth set of reliability metrics representing the second codeword; interleaving the third set of reliability metrics and the fourth set of reliability metrics to generate interleaved reliability metrics representing the interleaved codeword; and processing the interleaved reliability metrics with the trellis detector.
 16. The method as recited in claim 15, wherein the first code rate of the first codeword increases the accuracy of the trellis detector when processing the interleaved reliability metrics.
 17. The method as recited in claim 15, wherein the trellis detector implements a soft-input soft-output Viterbi algorithm.
 18. The method as recited in claim 15, further comprising: decoding the first set of reliability metrics and the second set of reliability metrics into the interleaved codeword; and decoding the interleaved codeword based on the at least one channel code constraint.
 19. The method as recited in claim 11, wherein the encoding of the first data into the first codeword and the encoding of the second data into the second codeword implement a low density parity check (LDPC) code.
 20. The method as recited in claim 11, wherein: the channel code constraint limits at least one of a maximum transition run (MTR) length and a maximum run-length limit (RLL); the interleaved codeword comprises an interleave segment length; and the interleave segment length is less than or equal to the run-length of the channel code constraint.
 21. The data storage device as recited in claim 1, wherein the control circuitry is further configured to: read the interleaved codeword from the storage medium to generate a read signal; process the read signal to generate a sequence of reliability metrics representing the interleaved codeword; and de-interleave the sequence of reliability metrics to generate a set of reliability metrics representing the first codeword and the second codeword.
 22. The data storage device as recited in claim 1, wherein the storage medium is a magnetic or optical disk.
 23. The data storage device as recited in claim 1, wherein the storage medium is solid state memory.
 24. The data storage device as recited in claim 1, wherein a size of the first codeword is ⅓ a size of the second codeword.
 25. The method as recited in claim 11, further comprising: reading the interleaved codeword from the storage medium to generate a read signal; processing the read signal to generate a sequence of reliability metrics representing the interleaved codeword; and de-interleaving the sequence of reliability metrics to generate a set of reliability metrics representing the first codeword and the second codeword.
 26. The method as recited in claim 11, wherein the storage medium is a disk comprising a plurality of servo sectors that define a plurality of servo tracks, and the writing the interleaved codeword comprises writing the interleaved codeword to a first servo sector of the plurality of servo sectors.
 27. The method as recited in claim 11, wherein a size of the first codeword is ⅓ a size of the second codeword. 